package com.chapter8;

public class LinkedListMain {

	public static void main(String[] args) {
		int[] A={1,3,4,4,6,6,6,7,11,14,14,15,17,18,20,21,24,24,24,24,25};
		int[] B={1,3,5,9,10};
		LinkedList l1=new LinkedList();
		for(int i=0;i<A.length;i++){
			l1.insert(A[i]);
		}
		
		LinkedList l2=new LinkedList();
		for(int i=0;i<B.length;i++){
			l2.insert(B[i]);
		}
		
		LinkedListOperator lo=new LinkedListOperator();
		//LinkedList l3=lo.mergeSortedList(l1, l2);
		//l3.traverse();
		System.out.println();
		//lo.reverseSublist(l1, 1, 5);
		//lo.reverseSublists(l1, 4);
		lo.removeDulpicates(l1);
		l1.traverse();
		System.out.println();
		//lo.cyclicShift(l1, 5);
		lo.evenOddMerge(l1);
		l1.traverse();
		System.out.println();
		lo.interLeave(l1);
		l1.traverse();
		lo.getPivot(l1, 15);
		System.out.println();
		l1.traverse();
		
		
	}
}
